Parameterized algorithm for 3-path vertex cover
نویسندگان
چکیده
منابع مشابه
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
A 3-path vertex cover in a graph is a vertex subset C such that every path of three vertices contains at least one vertex from C. The parameterized 3-path vertex cover problem asks whether a graph has a 3-path vertex cover of size at most k. In this paper, we give a kernel of 5k vertices and an O(1.7485)-time polynomial-space algorithm for this problem, both new results improve previous known b...
متن کاملParameterized Power Vertex Cover
We study a recently introduced generalization of the Vertex Cover (VC) problem, called Power Vertex Cover (PVC). In this problem, each edge of the input graph is supplied with a positive integer demand. A solution is an assignment of (power) values to the vertices, so that for each edge one of its endpoints has value as high as the demand, and the total sum of power values assigned is minimized...
متن کاملDeterministic Parameterized Connected Vertex Cover
In the Connected Vertex Cover problem we are given an undirected graph G together with an integer k and we are to find a subset of vertices X of size at most k, such that X contains at least one end-point of each edge and moreover X induces a connected subgraph. For this problem we present a deterministic algorithm running in O(2n) time and polynomial space, improving over previously best O(2.4...
متن کاملParameterized Streaming Algorithms for Vertex Cover
As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one. However, few results are known for optimization problems over such dynamic graph streams. In this paper, we introduce a new approach to handling graph strea...
متن کاملImproved Parameterized Upper Bounds for Vertex Cover
This paper presents an O(1.2738 + kn)-time polynomialspace parameterized algorithm for Vertex Cover improving the previous O(1.286+kn)-time polynomial-space upper bound by Chen, Kanj, and Jia. The algorithm also improves the O(1.2745k+kn)-time exponentialspace upper bound for the problem by Chandran and Grandoni.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.03.013